Optimal transportation networks and stations

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal transportation networks and stations

Here c is a given lower semicontinuous cost function, and πi are the marginals of π . In the typical case c(x, y) = ‖x − y‖, p > 1, and the pth root of the minimum in (1.1) is then called the p-Wasserstein distance Wp(μ, μ) between μ and μ. Brancolini and Buttazzo [6], Buttazzo and Stepanov [8], and Buttazzo et al. [7], among other works, consider a variant of the problem with two different med...

متن کامل

Optimal Escape Interdiction on Transportation Networks

Preventing crimes or terrorist attacks in urban areas is challenging. Law enforcement officers need to respond quickly to catch the attacker on his escape route, which is subject to time-dependent traffic conditions on transportation networks. The attacker can strategically choose his escape path and driving speed to avoid being captured. Existing work on security resource allocation has not co...

متن کامل

Optimal Networks for Mass Transportation Problems

In the framework of transport theory, we are interested in the following optimization problem: given the distributions μ of working people and μ− of their working places in an urban area, build a transportation network (such as a railway or an underground system) which minimizes a functional depending on the geometry of the network through a particular cost function. The functional is defined a...

متن کامل

Finding Optimal Refueling Policies in Transportation Networks

We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total transportation costs between vertices. The insight into the structure of optimal refueling policies leads to an elegant reduction of the problem of finding optimal refueling policies into the classical shortest path proble...

متن کامل

An Optimal Search Strategy for Mobile Stations in Wireless Networks

EEcient abstractions for Location management is a key consideration in wireless networks that support Universal Personal Communications. Location management involves a tracking component that maintains dynamic data on the location of mobile stations through a distributed database, and a search component that prescribes the manner in which the wireless network is to be paged so as to determine t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Interfaces and Free Boundaries

سال: 2009

ISSN: 1463-9963

DOI: 10.4171/ifb/223